Symbolic Synthesis for Epistemic Specifications with Observational Semantics
نویسندگان
چکیده
The paper describes a framework for the synthesis of protocols for distributed and multi-agent systems from specifications that give a program structure that may include variables in place of conditional expressions, together with specifications in a temporal epistemic logic that constrain the values of these variables. The epistemic operators are interpreted with respect to an observational semantics. The framework generalizes the notion of knowledge-based program proposed by Fagin et al (Dist. Comp. 1997). An algorithmic approach to the synthesis problem is developed that computes all solutions, using a reduction to epistemic model checking, that has been implemented using symbolic techniques. An application of the approach to synthesize mutual exclusion protocols is presented.
منابع مشابه
Symbolic Model Checking Algorithms for Temporal-Epistemic Logic
The paper presents ordered binary decision diagram based symbolic model checking algorithms for fragments of a temporal-epistemic logic based on the temporal logic CTL∗ with operators for the knowledge and common knowledge of multiple agents. The knowledge operators are interpreted with respect to several distinct semantics: observational, clock, synchronous perfect recall and asynchronous perf...
متن کاملSymbolic Model Checking Epistemic Strategy Logic
This paper presents a symbolic BDD-based model checking algorithm for an epistemic strategy logic with observational semantics. The logic has been shown to be more expressive than several variants of ATEL and therefore the algorithm can also be used for ATEL model checking. We implement the algorithm in a model checker and apply it to an application on train control system. The performance of t...
متن کاملBounded Model Checking for Linear Time Temporal-Epistemic Logic
We present a novel approach to the verification of multi-agent systems using bounded model checking for specifications in LTLK, a linear time temporal-epistemic logic. The method is based on binary decision diagrams rather than the standard conversion to Boolean satisfiability. We apply the approach to two classes of interpreted systems: the standard, synchronous semantics and the interleaved s...
متن کاملMCMAS: A Model Checker for the Verification of Multi-Agent Systems
While temporal logic in its various forms has proven essential to reason about reactive systems, agent-based scenarios are typically specified by considering high-level agents attitudes. In particular, specification languages based on epistemic logic [7], or logics for knowledge, have proven useful in a variety of areas including robotics, security protocols, web-services, etc. For example, sec...
متن کاملAutomatic verification of temporal-epistemic properties of cryptographic protocols
We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic specifications. We present a compiler that implements this translation. The compiler links to the sy...
متن کامل